Quasiequational Theories of Flat Algebras
نویسنده
چکیده
We prove that finite flat digraph algebras and, more generally, finite compatible flat algebras satisfying a certain condition are finitely q-based (possess a finite basis for their quasiequations). We also exhibit an example of a twelve-element compatible flat algebra that is not finitely q-based.
منابع مشابه
Quasiequational Theories of Flat Algebras
We prove that finite flat digraph algebras and, more generally, finite compatible flat algebras satisfying a certain condition are finitely q-based (possess a finite basis for their quasiequations). We also exhibit an example of a twelve-element compatible flat algebra that is not finitely q-based.
متن کاملThe consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Commutative, integral and bounded GBL-algebras form a subvariety of residuated lattices which provides the algebraic semantics of an interesting common fragment of intuitionistic logic and of several fuzzy logics. It is known that both the equational theory and the quasiequational theory of commutative GBL-algebras are decidable (in contrast to the noncommutative case), but their complexity has...
متن کاملAxiomatizability of positive algebras of binary relations
We consider all positive fragments of Tarski’s representable relation algebras and determine whether the equational and quasiequational theories of these fragments are finitely axiomatizable in first-order logic. We also look at extending the signature with reflexive, transitive closure and the residuals of composition.
متن کاملThe algebra of functions with antidomain and range
We give complete, finite quasiequational axiomatisations to algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras of unary partial functions under combinations of these operations. We look at the complexity of the equational theories and provide a nondeterministic polyno...
متن کاملThe quasiequational theory of relational lattices, in the pure lattice signature
The natural join and the inner union operations combine relations in a database. Tropashko and Spight realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices. They proposed then lattice theory as an algebraic approach, alternative to the relational algebra, to the theory of databases. Litak et al. proposed an axiomatiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011